independent set
英 [ˌɪndɪˈpendənt set]
美 [ˌɪndɪˈpendənt set]
网络 独立集; 独立集问题; 无关集; 独立集合; 自力集
双语例句
- An algorithm with closed circle DNA of the maximum independent set problem is put forward.
提出闭环DNA计算模型及其基本生化实验，给出解决最大独立集问题的闭环DNA算法。 - We use the geometric property of independent set to build our virtual coordinate system.
我们使用最大独立集合的几何特性来发展我们的虚拟座标系统。 - Cooperated Bidding Algorithm for Spectrum Allocation Based on Maximal Independent Set
基于极大独立集的协作竞价频谱分配算法 - Finally, the paper carried on the analogy to DNA sequence design problem and graph independent set problem, and proved the maximum DNA sequences set problem was a NP complete problem.
最后通过类比DNA编码问题和图的独立集问题，说明了求解最大DNA序列集合问题是NP完全的。 - In this paper, the model was modified again and a modified DNA sticker model for maximum independent set of graph was built.
首先将图的独立集问题转化为可满足性问题，然后利用本文改进的粘贴模型给出了图的最大独立集的DNA算法。 - Finally, an intelligent man gradually finds an independent set of values, unique skills, and an original personality that belong to him alone.
终于，聪明的人类逐渐找到一个属于个人的独立的价值观，独特的专长和特立的人格。 - This paper shows by counterexamples that the algorithms of finding maximum independent set and minimum dominating set of a graph in [ 1] are wrong.
用反例证明了文[1]中的最大独立集算法和最小支配集算法的结论都是错误的，因而图论中独立支配集的求解问题并没有解决。 - Improvement on Vertex Cover and Independent Set Problem for Low Degree Graphs
低度图的点覆盖和独立集问题下界改进 - An exact algorithm to improve the upper bound of vertex cover and independent set problem for low degree graphs is presented.
给出了一种提高低度图点覆盖和独立集问题下界的精确算法。 - It's based on the model of Hopfield neural network, changing the problem of array reconfiguration into the problem of maximum independent set of contradiction graph.
该文基于Hopfield神经网络为模型，将阵列的重构问题转化为矛盾图的最大独立集问题。 - In this article, an efficient algorithm is presented, which can find out a maximum clique ( or maximum independent set, minimum point covering), and its computer programming ( with BASIC language) is also given.
本文给出了一个有效的求任意简单图的最大团集（最大独立集，最小点覆盖）算法并给出了具体程序（用BASIC语言）。 - In this paper, we give some inequalities on the independent set numbers of a matroid, by using the Hilbert function of the matroid algebra.
本文利用已建立的拟阵代数结构和面环的Hilbert函数，给出了拟阵中独立集个数的几个不等式。 - A generalized discrete neural network for solving maximal independent set ( MIS) problem is designed.
构造了一种用于最大独立集（MIS）问题求解的广义离散神经网络模型（GDHN）。 - The concept of the independent set polynomial of simple graphs is defined, the relationship between the independent set polynomial and the maching polynomial of the graphs is discussed, the structural characterization of the independent set polynomial of the graphs is also given in the paper.
定义了简单图的独立集多项式，讨论了图的独立集多项式与图的匹配多项式的关系，给出了图的独立集多项式的结构特征。 - A clustering algorithm based on highest vector-weighted independent set in wireless network
无线网络中基于最高向量权独立集的分群算法 - The maximum independent set problem is a classical problem in combinatorial optimization.
最大独立集问题（MaximumIndependentSetproblem，MIS）是图论中经典的组合优化问题。 - In this paper, we research the relations between the maximal independent set and minimal covering set of a graph, and give a general logical and recursive algorithm of maximal independent set and minimal covering set.
本文主要研究了图的极大独立集与极小覆盖集之间的关系，并给出了将图的所有极大独立集与极小覆盖集一次性给出的逻辑及递归算法。 - Based on root tree and Maximal Weighted Independent Set, we propose the EACT ( Energy-Aware Clustering Tree) algorithm and the maintenance and update algorithm of the cluster tree backbone network.
文中利用图论中极大权独立集和根树的概念给出一种求簇树骨干网的EACT算法及对该骨干网的维护和更新算法。 - The Logical and Recursive Algorithm of Maximal Independent Set and Minimal Covering Set
极大独立集与极小覆盖集的逻辑及递归算法 - On the basis of the Hopfield networks, this paper deals with the maximal clique and the maximal independent set of a graph by mathematical analysis of the problem, the improvements of the performance are illustrated with some simulation examples.
本文应用Hopfield网络，系统地研究了图的最大团和最大独立集问题，通过建立相应的数学理论，改进了这方面已有的工作，并进行了模拟实验，给出了实验研究的结果。 - Secondly, it gives two weighted convex cone independent set problems.
本文提出两个赋权凸锥独立集合问题。 - Network Decomposition and a New Algorithm for Maximum Independent Set ( I)
网络分解及最大独立集算法研究（Ⅰ） - Algorithm for maximal clique and independent set of a graph based on Hopfield networks
基于Hopneld网络的图的最大团和最大独立集算法 - The transfer-matrix expressions of the independent set polynomial and the Clar covering polynomial of some graphs are given here.
本文利用转移矩阵方法分别给出了某些图类的独立集多项式和一类六角系统的Clar覆盖多项式的转移矩阵表示。 - Study on Maximum Clique and Maximum Weighted Independent Set Problem Based on Q 0-1 Programming
Q0-1规划模型下最大团、最大加权独立集问题的研究 - This study suggests that colleges and universities set up a new pattern of Teacher Education that combines independent set and comprehensive training, close administration and open management. In the current critical period of transition of Teacher Education, it has a practical guiding significance.
本研究建议在大学层面建立一个独立设置与综合培养、封闭管理与多元开放相结合的新型教师教育模式的构想，在当前教师教育转型的关键时期，有着现实的指导意义。 - On the basis of concepts and properties of the independent set and the clique, the paper researches the properties of a special network and obtains an excellent algorithm, and then constructs a 2-stable network whose price of stability is equal to 1.
从独立集和团的角度，研究了其稳定网络的特性，设计了一种好的算法，构造出了个2-稳定网络，其稳定性代价是1。 - In chapter five the problem of solving the Ramsey number is transformated to DNA computing models to solve maximum clique and maximum independent set problems.
在第五章中把求解Ramsey数问题转化为求解最大团问题和最大独立集问题，然后利用DNA模型进行解决。 - The cluster set generated by BPEC is proved to be a Maximum Independent Set, which can cover all network nodes.
由BPEC算法产生的簇头集合被证明是一个最大独立集，簇头集合能覆盖网络的所有节点。 - A spectrum allocation algorithm using maximal independent set ( MIS) is proposed based on the characteristic and request of the cognitive radio system.
针对认知无线电系统的特点和要求，提出了一种基于极大独立集的频谱分配算法。